منابع مشابه
Clique-Transversal Sets in Cubic Graphs
A clique-transversal set S of a graph G is a set of vertices of G such that S meets all cliques of G. The clique-transversal number, denoted τc(G), is the minimum cardinality of a clique-transversal set in G. In this paper we present an upper bound and a lower bound on τc(G) for cubic graphs, and characterize the extremal cubic graphs achieving the lower bound. In addition, we present a sharp u...
متن کاملNielsen theory of transversal fixed point sets
Examples exist of smooth maps on the boundary of a smooth manifold M which allow continuous extensions over M without fixed points but no such smooth extensions. Such maps are studied here in more detail. They have a minimal fixed point set when all transversally fixed maps in their homotopy class are considered. Therefore we introduce a Nielsen fixed point theory for transversally fixed maps o...
متن کاملA colorful theorem on transversal lines to plane convex sets
In 1982 (see [1]) Imre Bárány observed that some of the classical theorems in convexity admit interesting and mysterious generalizations which he called “colorful theorems”. For example, the Colorful Helly Theorem says that if a family (repetitions of the same sets are allowed) of compact convex sets in Rk is colored (properly) with k+1 colors and it has the property that any choice of k+1 diff...
متن کاملTransversal and Function Matroidal Structures of Covering-Based Rough Sets
In many real world applications, information blocks form a covering of a universe. Covering-based rough set theory has been proposed to deal with this type of information. It is more general and complex than classical rough set theory, hence there is much need to develop sophisticated structures to characterize covering-based rough sets. Matroids are important tools for describing graphs and li...
متن کاملCharacterizations of Transversal and Fundamental Transversal Matroids
A result of Mason, as refined by Ingleton, characterizes transversal matroids as the matroids that satisfy a set of inequalities that relate the ranks of intersections and unions of nonempty sets of cyclic flats. We prove counterparts, for fundamental transversal matroids, of this and other characterizations of transversal matroids. In particular, we show that fundamental transversal matroids a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematica Moravica
سال: 2004
ISSN: 1450-5932,2560-5542
DOI: 10.5937/matmor0402053t